On the structure and the number of prime implicants of 2-s
نویسنده
چکیده
Let m(n, k) be the maximum number of prime implicants that any k-CNF on n variables can have. We show that 3 n 3 ≤ m(n, 2) ≤ (1 + o(1))3n3 .
منابع مشابه
Prime and Non-prime Implicants in the Minimization of Multiple-valued Logic Functions
We investigate minimal sum-of-products expressions for multiple-valued logic functions for realization by programmable logic arrays. Our focus is on expressions where product terms consist of the MIN of interval literals on input variables and are combined using one of two operations SUM or MAX. In binary logic, the question of whether or not prime implicants are sufficient to optimally realize...
متن کاملFault Tree Analysis: 10 Prime Implicants and Beyond
The performances of almost all available fault tree analysis tools are limited by the performance of the prime implicant computation procedure they use. All these procedures manipulate the prime implicants of the fault trees explicitly, so that their complexities are directly related to the number of prime implicants to be generated. This paper presents a new analysis method of coherent as well...
متن کاملOn Generalization of prime submodules
Let R be a commutative ring with identity and M be a unitary R-module. Let : S(M) −! S(M) [ {;} be a function, where S(M) is the set of submodules ofM. Suppose n 2 is a positive integer. A proper submodule P of M is called(n − 1, n) − -prime, if whenever a1, . . . , an−1 2 R and x 2 M and a1 . . . an−1x 2P(P), then there exists i 2 {1, . . . , n − 1} such that a1 . . . ai−1ai+1 . . . an−1x 2 P...
متن کاملFault Tree Analysis: 1020 Prime Implicants and Beyond
The performances of almost all available fault tree analysis tools are limited by the performance of the prime implicant computation procedure they use. All these procedures manipulate the prime implicants of the fault trees explicitly, so that their complexities are directly related to the number of prime implicants to be generated. This paper presents a new analysis method of coherent as well...
متن کاملA note on 3-Prime cordial graphs
Let G be a (p, q) graph. Let f : V (G) → {1, 2, . . . , k} be a map. For each edge uv, assign the label gcd (f(u), f(v)). f is called k-prime cordial labeling of G if |vf (i) − vf (j)| ≤ 1, i, j ∈ {1, 2, . . . , k} and |ef (0) − ef (1)| ≤ 1 where vf (x) denotes the number of vertices labeled with x, ef (1) and ef (0) respectively denote the number of edges labeled with 1 and not labeled with 1....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Applied Mathematics
دوره 200 شماره
صفحات -
تاریخ انتشار 2016